Implications for High Capacity Data Hiding in Presence of Lossy Compression
نویسنده
چکیده
We derive capacity bounds for watermarking and data hiding in the presence of JND perceptual coding for a class of techniques that do not suffer from host signal interference. By modeling the lossy compression distortions on the hidden data using non-Gaussian statistics, we demonstrate that binary antipodal channel codes achieve capacity. It is shown that the data hiding capacity is at most equal to the loss in storage efficiency bit rate if watermarking and quantization for lossy compression occur in the same domain.
منابع مشابه
Implications for High Capacity Data Hiding in the Presence of Lossy Compression
We derive capacity bounds for watermarking and data hiding in the presence of JND perceptual coding for a class of techniques that do not suffer from host signal interference. By modeling the lossy compression distortions on the hidden data using non-Gaussian statistics, we demonstrate that binary antipodal channel codes achieve capacity. It is shown that the data hiding capacity is at most equ...
متن کاملThe Choice of Watermark Domain in the Presence of Compression
In this paper, we determine the watermark domain that maximizes data hiding capacity. We focus on the situation in which the watermarked signal undergoes lossy compression involving quantization in a specified compression domain. A novel linear model for the process of quantization is proposed which leads to analytical results estimating the data hiding capacity for various watermarking domains...
متن کاملA High Capacity Information Hiding Algorithm Based on Invariance Properties of JPEG Compression
Imperceptibility, robustness and hiding capacity are main indexes to measure information hiding algorithm. However, they always restrict each other. Invariance of JPEG compression has been analyzed at first. Then, according to invariance of JPEG compression, information hiding algorithm which can embed information in DCT median and high frequency coefficients has been proposed. Information embe...
متن کاملImage data hiding based on capacity-approaching dirty-paper coding
We present an image data-hiding scheme based on near-capacity dirty-paper codes. The scheme achieves high embedding rates by ”hiding” information into mid-frequency DCT coefficients among each DCT block of the host image. To reduce the perceptual distortion due to data-hiding, the mid-frequency DCT coefficients are first perceptually scaled according to Watson’s model. Then a rate-1/3 projectio...
متن کاملChannel models for high-capacity information hiding in images
We consider the scenario of blind information hiding in images as a communications channel, where the channel noise is caused by the embedding and blind extraction method as well as by any lossy compression method utilized to store and transmit the image. We assume that the objectives of the information hiding method are the maximization of payload and its visual and statistical imperceptibilit...
متن کامل